On probabilistic linguistic term set operations
نویسندگان
چکیده
In a recent work (Wang et al. 2020), partial order ⪯, join operation ⊔ and meet ⊓ of probabilistic linguistic term sets (PLTSs) were introduced it was proved that L1 L2 ⪯ L2. this paper, we demonstrate its operations are not satisfy the above requirement. To requirement, modify operations. Moreover, define negation PLTSs based on ⪯. The combinations proposed negation, modified yield bounded, distributive lattice over PLTSs. Meanwhile, also new which, together with operation, bounded De Morgan
منابع مشابه
Fuzzy Set Approximation Based on Linguistic Term Shifting
Fuzzy systems working with a sparse rule base apply special reasoning techniques in order to ensure the acceptable output in case of observations hitting the gap between the antecedent parts of the rules, too. The methods that follow the generalized methodology of the fuzzy rule interpolation (GM) [1] produce the conclusion in two steps. First a new rule is interpolated in the position determin...
متن کاملSet Operations for Recurrent Term Schematizations
Reasoning on programs and automated deduction often require the manipulation of innnite sets of objects. Many formalisms have been proposed to handle such sets. Here we deal with the formalism of recurrent terms proposed by Chen and Hsiang and subsequently reened by several authors. These terms contains iterated parts and counter variables to control the iteration, providing an important gain i...
متن کاملResearch on Basic Operations for Query Probabilistic XML Document Based on Path Set
Probabilistic XML tree is a typical probabilistic XML data model for representing uncertainty in the form of probability which can be described the nested probabilistic XML element unit. The path set in probabilistic XML unit tree can be analyzed through parsing it and drawing out the corresponding probabilistic XML unit schema tree. The node probability and the node probability threshold compu...
متن کاملOn Probabilistic Term Rewriting
We study the termination problem for probabilistic term rewrite systems. We prove that the interpretation method is sound and complete for a strengthening of positive almost sure termination, when abstract reduction systems and term rewrite systems are considered. Two instances of the interpretation method—polynomial and matrix interpretations—are analyzed and shown to capture interesting and n...
متن کاملOn Combining Theories with Shared Set Operations
We explore the problem of automated reasoning about the nondisjoint combination of theories that share set variables and operations. We prove a combination theorem and apply it to show the decidability of the satisfiability problem for a class of formulas obtained by applying propositional operations to quantified formulas belonging to several expressive decidable logics.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Intelligent and Fuzzy Systems
سال: 2023
ISSN: ['1875-8967', '1064-1246']
DOI: https://doi.org/10.3233/jifs-223747